Markov Towers and Stochastic Properties of Billiards

نویسنده

  • DOMOKOS SZÁSZ
چکیده

Markov partitions work most efficiently for Anosov systems or for Axiom A systems. However, for hyperbolic dynamical systems which are either singular or whose hyperbolicity is nonuniform, the construction of a Markov partition, which in these cases is necessarily countable, is a rather delicate issue even when such a construction exists. An additional problem is the use of a countable Markov partition for proving probabilistic statements. For a wide class of hyperbolic systems, L. S. Young, in 1998, constructed so called Markov towers, which she could apply successfully to establish nice, for instance, exponential correlation decay, and, moreover, as a consequence, a central limit theorem. The aim of this survey is twofold. First we show how the Markov tower construction is applicable for obtaining finer stochastic properties, like a local limit theorem of probability theory. Here the fundamental method is the study of the spectrum of the Fourier transform of the Perron–Frobenius operator. These ideas and results are applicable to all systems Young has been considering. Second, we survey the problem of recurrence of the planar Lorentz process. As an application of the results from the first part, we obtain a dynamical proof of recurrence for the finite horizon case. Here basically different proofs were given by K. Schmidt, in 1998, and J.-P. Conze, in 1999. As another application we can also treat the infinite horizon case, where already the global limit theorem is absolutely novel. It is not a central one, the scaling is √ n log n in contrast to the classical √ n one. Beyond thus giving a rigorous proof for earlier heuristic ideas of P. Bleher, which used three delicate and hard hypotheses, we can also a) verify the local version of this limit theorem for the free flight function and b) prove the recurrence of the planar Lorentz process in the infinite horizon case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks Derived from Billiards

We introduce a class of random dynamical systems derived from billiard maps, which we call random billiards, and study certain random walks on the real line obtained from them. The interplay between the billiard geometry and the stochastic properties of the random billiard is investigated. Our main results are concerned with the description of the spectrum of the random billiard’s Markov operat...

متن کامل

Functional Norms for Young Towers

We introduce functional norms for hyperbolic Young towers which allow us to directly study the transfer operator on the full tower. By eliminating the need for secondary expanding towers commonly employed in this context, this approach simplifies and expands the analysis of this class of Markov extensions and the underlying systems for which they are constructed. As an example, we prove large d...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Stochastic Billiards for Sampling from the Boundary of a Convex Set

Stochastic billiards can be used for approximate sampling from the boundary of a bounded convex set through the Markov Chain Monte Carlo (MCMC) paradigm. This paper studies how many steps of the underlying Markov chain are required to get samples (approximately) from the uniform distribution on the boundary of the set, for sets with an upper bound on the curvature of the boundary. Our main theo...

متن کامل

Modeling billiards games

Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for A.I. research. Drawing on the insight gained from our victory in the 2008 ICGA billiards tournament, we define a game-theoretic model of these types of billiards games. The modeling is surprisingly subtle. While sharin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003